Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi

Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for implementing recursive computation eeciently. To capture its semantic nature, we introduce categorical models for lambda calculi with cyclic sharing (cyclic lambda graphs), using notions of computation by Moggi / Power and Robinson and traced monoidal categories by Joyal, Street and Verity. The former is used for representing the notion of sharing, whereas the latter for cyclic data structures. Our new models provide a semantic framework for understanding recur-sion created from cyclic sharing, which includes traditional models for recursion created from xed points as special cases. Our cyclic lambda calculus serves as a uniform language for this wider range of models of recursive computation.